The reliable p -median problem with at-facility service
نویسندگان
چکیده
منابع مشابه
Reliable p-median facility location problem: two-stage robust models and algorithms
In this paper, we propose a set of two-stage robust optimization models to design reliable p-median facility location networks subject to disruptions. A customized column-and-constraint generation approach is implemented and shown to be more effective than Benders cutting plane method. Numerical experiments are performed on real data and management insights on system design are presented. Our s...
متن کاملReliable Facility Location Problem with Facility Protection
This paper studies a reliable facility location problem with facility protection that aims to hedge against random facility disruptions by both strategically protecting some facilities and using backup facilities for the demands. An Integer Programming model is proposed for this problem, in which the failure probabilities of facilities are site-specific. A solution approach combining Lagrangian...
متن کاملThe p-Median Problem
The p-median problem is central to much of discrete location modeling and theory. While the p-median problem is NP-hard on a general graph, it can be solved in polynomial time on a tree. A linear time algorithm for the 1-median problem on a tree is described. We also present a classical formulation of the problem. Basic construction and improvement algorithms are outlined. Results from the lite...
متن کاملThe p-Median Problem with Concave Costs
The p-median problem has been widely studied in the literature during the last decades especially its linear version. We propose a capacitated p-median problem with concave costs, in which the global cost incurred for each established facility is a concave function of the quantity q delivered by this facility. The unit distribution cost decreases with the increased quantity of output or demand ...
متن کاملThe Hamiltonian p-Median Problem
We deal, from a theoretical point of view, with the asymmetric Hamiltonian p–median problem. This problem, which has many applications, can be viewed as a mixed routing location problem. An ILP-formulation based on a new class of inequalities (subtour number constraints) is presented. The associated Hamiltonian p–median polytope is examined, in particular its dimension and its affine hull. We d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2015
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2015.03.049